A Consistently-Executing Graph-Based Approach for Malware Packer Identification
نویسندگان
چکیده
منابع مشابه
A static, packer-agnostic filter to detect similar malware samples
The steadily increasing number of malware variants is becoming a significant problem, clogging the input queues of automated analysis tools and polluting malware repositories. The generation of malware variants is made easy by automatic packers and polymorphic engines, which can produce many distinct versions of a single executable using compression and encryption. Malware analysis tools and re...
متن کاملA Static, Packer-Agnostic Filter to Detect Similar Malware Samples
The steadily increasing number of malware variants is a significant problem, clogging the input queues of automated analysis tools. The generation of malware variants is made easy by automatic packers and polymorphic engines, which produce by encryption and compression a multitude of distinct versions. A great deal of time and resources could be saved by prioritizing samples to analyze, either,...
متن کاملPlanning while Executing: A Constraint-Based Approach
We propose a planning architecture where the planner and the executor interact with each other in order to face dynamic changes of the application domain. According to the deferred planning strategy proposed in [14], a plan schema is produced o -line by a generative constraint based planner and re ned at execution time by retrieving up-todate information when that available is no longer valid. ...
متن کاملA new approach in graph- based integrated production and distribution scheduling for perishable products
This study is concerned with how the quality of perishable products can be improved by shortening the time interval between production and distribution. As special types of food such as dairy products decay fast, the integration of production and distribution scheduling (IPDS) is investigated. An integrated scheduling of both processes improves the performance and costs because the separated sc...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2910268